Generating Sequential Space-Filling Designs Using Genetic Algorithms and Monte Carlo Methods
نویسندگان
چکیده
In this paper, the authors compare a Monte Carlo method and an optimization-based approach using genetic algorithms for sequentially generating space-filling experimental designs. It is shown that Monte Carlo methods perform better than genetic algorithms for this specific problem.
منابع مشابه
Evaluating Quasi-Monte Carlo (QMC) algorithms in blocks decomposition of de-trended
The length of equal minimal and maximal blocks has eected on logarithm-scale logarithm against sequential function on variance and bias of de-trended uctuation analysis, by using Quasi Monte Carlo(QMC) simulation and Cholesky decompositions, minimal block couple and maximal are founded which are minimum the summation of mean error square in Horest power.
متن کاملParticle Markov Chain Monte Carlo
Markov chain Monte Carlo (MCMC) and sequential Monte Carlo (SMC) methods have emerged as the two main tools to sample from high-dimensional probability distributions. Although asymptotic convergence of MCMC algorithms is ensured under weak assumptions, the performance of these latters is unreliable when the proposal distributions used to explore the space are poorly chosen and/or if highly corr...
متن کاملLimit theorems for weighted samples with applications to Sequential Monte Carlo Methods
In the last decade, sequential Monte-Carlo methods (SMC) emerged as a key tool in computational statistics (see for instance Doucet et al. (2001), Liu (2001), Künsch (2001)). These algorithms approximate a sequence of distributions by a sequence of weighted empirical measures associated to a weighted population of particles. These particles and weights are generated recursively according to ele...
متن کاملSequential Monte Carlo Samplers
In this paper, we propose a methodology to sample sequentially from a sequence of probability distributions known up to a normalizing constant and defined on a common space. These probability distributions are approximated by a cloud of weighted random samples which are propagated over time using Sequential Monte Carlo methods. This methodology allows us to derive simple algorithms to make para...
متن کاملParticle Markov chain Monte Carlo methods
Markov chain Monte Carlo and sequential Monte Carlo methods have emerged as the two main tools to sample from high dimensional probability distributions.Although asymptotic convergence of Markov chain Monte Carlo algorithms is ensured under weak assumptions, the performance of these algorithms is unreliable when the proposal distributions that are used to explore the space are poorly chosen and...
متن کامل